Conditional narrowing modulo a set of equations
Identifieur interne : 00D209 ( Main/Exploration ); précédent : 00D208; suivant : 00D210Conditional narrowing modulo a set of equations
Auteurs : Alexander Bockmayr [Allemagne]Source :
- Applicable Algebra in Engineering, Communication and Computing [ 0938-1279 ] ; 1993-09-01.
English descriptors
- KwdEn :
- Teeft :
- Algorithm, Bockmayr, Canonical, Canonical term, Coherent modulo, Comput, Conditional, Conditional case, Conditional equations, Conditional term, Confluent modulo, Constraint, Constraint logic, Constraint logic programming, Derivation, Equational, Equational case, Equational theories, Equational theory, Equations etriv, Etriv, Extravariables, Function symbols, Functional programming, Heidelberg, Induction hypothesis, Irreflexive transitive, Lecture notes, Logic programming, Modulo, Multiset, Noetherian induction, Proc, Programming, Search space, Springer, Substitution, Subterm, Technical report, Unconditional case, Univ.
Abstract
Abstract: Narrowing is a universal unification procedure for equational theories given by a canonical term rewrite system. In this paper we introduce conditional narrowing modulo a set of conditional equations and give a full proof of its correctness and completeness for equational conditional rewrite systemsR, E without extravariables whereE is regular andR, E is Church-Rosser moduloE and decreasing moduloE. This result can be seen as the theoretical foundation of a special form of constraint logic and functional programming.
Url:
DOI: 10.1007/BF01202035
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 002249
- to stream Istex, to step Curation: 002219
- to stream Istex, to step Checkpoint: 002E56
- to stream Main, to step Merge: 00DA82
- to stream Main, to step Curation: 00D209
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Conditional narrowing modulo a set of equations</title><author><name sortKey="Bockmayr, Alexander" sort="Bockmayr, Alexander" uniqKey="Bockmayr A" first="Alexander" last="Bockmayr">Alexander Bockmayr</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:93F5360EBA1A6B7CDC6AC203F6C5B0322DB2BE72</idno><date when="1993" year="1993">1993</date><idno type="doi">10.1007/BF01202035</idno><idno type="url">https://api.istex.fr/ark:/67375/1BB-HBNH3Q0T-0/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">002249</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">002249</idno><idno type="wicri:Area/Istex/Curation">002219</idno><idno type="wicri:Area/Istex/Checkpoint">002E56</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">002E56</idno><idno type="wicri:doubleKey">0938-1279:1993:Bockmayr A:conditional:narrowing:modulo</idno><idno type="wicri:Area/Main/Merge">00DA82</idno><idno type="wicri:Area/Main/Curation">00D209</idno><idno type="wicri:Area/Main/Exploration">00D209</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Conditional narrowing modulo a set of equations</title><author><name sortKey="Bockmayr, Alexander" sort="Bockmayr, Alexander" uniqKey="Bockmayr A" first="Alexander" last="Bockmayr">Alexander Bockmayr</name><affiliation wicri:level="3"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Max-Planck-Institut für Informatik, Im Stadtwald, W-6600, Saarbrücken</wicri:regionArea><placeName><region type="land" nuts="2">Sarre (Land)</region><settlement type="city">Sarrebruck</settlement></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author></analytic><monogr></monogr><series><title level="j">Applicable Algebra in Engineering, Communication and Computing</title><title level="j" type="abbrev">AAECC</title><idno type="ISSN">0938-1279</idno><idno type="eISSN">1432-0622</idno><imprint><publisher>Springer-Verlag</publisher><pubPlace>Berlin/Heidelberg</pubPlace><date type="published" when="1993-09-01">1993-09-01</date><biblScope unit="volume">4</biblScope><biblScope unit="issue">3</biblScope><biblScope unit="page" from="147">147</biblScope><biblScope unit="page" to="168">168</biblScope></imprint><idno type="ISSN">0938-1279</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0938-1279</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Conditional narrowing</term><term>Conditional rewriting</term><term>Constraint logic and functional programming</term><term>E -unification</term></keywords><keywords scheme="Teeft" xml:lang="en"><term>Algorithm</term><term>Bockmayr</term><term>Canonical</term><term>Canonical term</term><term>Coherent modulo</term><term>Comput</term><term>Conditional</term><term>Conditional case</term><term>Conditional equations</term><term>Conditional term</term><term>Confluent modulo</term><term>Constraint</term><term>Constraint logic</term><term>Constraint logic programming</term><term>Derivation</term><term>Equational</term><term>Equational case</term><term>Equational theories</term><term>Equational theory</term><term>Equations etriv</term><term>Etriv</term><term>Extravariables</term><term>Function symbols</term><term>Functional programming</term><term>Heidelberg</term><term>Induction hypothesis</term><term>Irreflexive transitive</term><term>Lecture notes</term><term>Logic programming</term><term>Modulo</term><term>Multiset</term><term>Noetherian induction</term><term>Proc</term><term>Programming</term><term>Search space</term><term>Springer</term><term>Substitution</term><term>Subterm</term><term>Technical report</term><term>Unconditional case</term><term>Univ</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: Narrowing is a universal unification procedure for equational theories given by a canonical term rewrite system. In this paper we introduce conditional narrowing modulo a set of conditional equations and give a full proof of its correctness and completeness for equational conditional rewrite systemsR, E without extravariables whereE is regular andR, E is Church-Rosser moduloE and decreasing moduloE. This result can be seen as the theoretical foundation of a special form of constraint logic and functional programming.</div></front></TEI><affiliations><list><country><li>Allemagne</li></country><region><li>Sarre (Land)</li></region><settlement><li>Sarrebruck</li></settlement></list><tree><country name="Allemagne"><region name="Sarre (Land)"><name sortKey="Bockmayr, Alexander" sort="Bockmayr, Alexander" uniqKey="Bockmayr A" first="Alexander" last="Bockmayr">Alexander Bockmayr</name></region><name sortKey="Bockmayr, Alexander" sort="Bockmayr, Alexander" uniqKey="Bockmayr A" first="Alexander" last="Bockmayr">Alexander Bockmayr</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00D209 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 00D209 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:93F5360EBA1A6B7CDC6AC203F6C5B0322DB2BE72
|texte= Conditional narrowing modulo a set of equations
}}
| This area was generated with Dilib version V0.6.33. |  |